Queries on Databases With User-Defined Functions
نویسنده
چکیده
The notion of a database query is generalized for databases with user-defined functions. Then, we can prove that the computable queries coincide with those expressible by an extension of the relational machine, with oracles ([4]). This implies that any complete query language, extended with user-defined function symbols in a "reasonable" way, is still complete. We give an example of a complete query language with user-defined functions, and discuss its connections with object inventions. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-62. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/282 Queries on Databases with User-Defined Functions MS-CIS-93-62 LOGIC & COMPUTATION 70
منابع مشابه
AKYRA: Efficient Keyword-Query Cleaning in Relational Databases
Databases often cannot find answers to keyword queries due to inconsistencies in the data or typos in the queries. Solving this problem requires efficient techniques to clean keywords in queries. In this paper we systematically study different approaches to cleaning keyword queries in relational databases. We first consider applications where we can support queries outside a database. We develo...
متن کاملUsing q-grams in a DBMS for Approximate String Processing
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data. This is due, for example, to the prevalence of typographical errors in data, and multiple conventions for recording attributes such as name and address. Commercial databases do not support approximate string queries directly, and it is a ...
متن کاملمدل جدیدی برای جستجوی عبارت بر اساس کمینه جابه‌جایی وزن‌دار
Finding high-quality web pages is one of the most important tasks of search engines. The relevance between the documents found and the query searched depends on the user observation and increases the complexity of ranking algorithms. The other issue is that users often explore just the first 10 to 20 results while millions of pages related to a query may exist. So search engines have to use sui...
متن کاملQuerying RDF Schema Views of Relational Databases
Petrini, J. 2008. Querying RDF Schema Views of Relational Databases. Acta Universitatis Upsaliensis. Uppsala Dissertations from the Faculty of Science and Technology 75. 117 pp. Uppsala. ISBN 978-91-554-7202-3. The amount of data found on the web today and its lack of semantics makes it increasingly harder to retrieve a particular piece of information. With the Resource Description Framework (R...
متن کاملبررسی میزان همخوانی عبارت‌های جستجوی کاربران با اصطلاحات پیشنهادی مقالات در پیشینه‌های کتابشناختی پایگاه‌های اطلاعاتی لاتین EBSCO و IEEE
Purpose: This study aims to investigate correspondence of users' queries with alternative terms of Latin databases namely IEEE and EBSCO. Databases display subjective content of their documents through natural or controlled language vocabularies in specified bibliographic fields along with other bibliographic information that are called papers alternative terms. Methodology: We used content an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014